High radix parallel architecture for GF(p) elliptic curve processor
نویسندگان
چکیده
A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better improved performance than conventional choice of projecting into the current (X/Z,Y/Z). We also propose to use high radix modulo multipliers which give a wide range of area-time trade-offs. The proposed architecture is a significant challenger for implementing data security systems based on elliptic curve cryptography.
منابع مشابه
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF (p). This is a scalable architecture in terms of area and speed specially suited for memory-rich hardware platforms such a field programmable gate arrays (FPGAs). This processor uses a new type of high-radix Montgomery multiplier that relies on the precomp...
متن کاملVLSI core architecture for GF(p) elliptic curve crypto processor
A novel GF(p) crypto processor core architecture is presented in this paper. The core is used to implement GF(p) Elliptic Curve Cryptosystem (ECC). The architecture is such that a single core can be used to implement ECC or alternatively a two core solution can be adopted. As a result, the core architecture allows the exploitation of the parallelism that exists in elliptic curve point addition ...
متن کاملMerging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
This paper merges between elliptic curve addition presents a modified processor architecture for Elliptic Curve Cryptography computations in Galois Fields GF(p). The architecture incorporates the methodology of pipelining to utilize the benefit of both parallel and serial implementations. It allows the exploitation of the inherited independency that exists in elliptic curve point addition and d...
متن کاملGF(2) Elliptic Curve Cryptographic Processor Architecture Based On Bit Level Pipelined Digit Serial Multiplication
New processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates to convert GF(2) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than usin...
متن کاملEfficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations
This paper presents a processor architecture for elliptic curve cryptography computations over GF(p). The speed to compute the Elliptic-curve point multiplication over the prime fields GF(p) is increased by using the maximum degree of parallelism, and by carefully selecting the most appropriate coordinates system. The proposed Elliptic Curve processor is implemented using FPGAs. The time, area ...
متن کامل